Bounded-Distance Decoding: Algorithms, Decisions Regions, and Pseudo Nearest Neighbors - Information Theory, IEEE Transactions on
نویسندگان
چکیده
For a code C, bounded-distance decoding algorithms perform as optimal algorithms within the balls B(c), centered at the codewords c 2 C, with radius equal to half the minimum Euclidean distance of the code. Thus distinct bounded-distance algorithms vary in performance due to their different behavior outside the balls B(c). We investigate this issue by analyzing the decision regions of some known (e.g., GMD) and some new bounded-distance algorithms presented in this work. In particular, we show that there are three distinct types of nearest neighbors and classify them according to their influence on the decision region. Simulation results and computer-generated images of the decision regions are provided to illustrate the analytical results.
منابع مشابه
Geometrical and performance analysis of GMD and Chase decoding algorithms
The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by No;e = No + NBDD; where NBDD denotes the number of additional, noncodeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original Generalized Minimum Distance (GMD) and Chase decoding algorithms. After car...
متن کاملSoft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
This paper considers two kinds of algorithms. (i) If # is a binary code of length n, a ‘‘soft decision’’ decoding algorithm for # changes an arbitrary point of Rn into a nearest codeword (nearest in Euclidean distance). (ii) Similarly a decoding algorithm for a lattice Λ in Rn changes an arbitrary point of Rn into a closest lattice point. Some general methods are given for constructing such alg...
متن کاملOn Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
We propose a new decoding algorithm for random binary linear codes. The so-called information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 . In the late 80s, Stern proposed a sort-and-match version for Prange’s algorithm, on which all variants of the currently best known decoding algorithms are build. The fastest algorithm of Becker, Joux, May and Meurer (2012) achie...
متن کاملDetecting Suspicious Card Transactions in unlabeled data of bank Using Outlier Detection Techniqes
With the advancement of technology, the use of ATM and credit cards are increased. Cyber fraud and theft are the kinds of threat which result in using these Technologies. It is therefore inevitable to use fraud detection algorithms to prevent fraudulent use of bank cards. Credit card fraud can be thought of as a form of identity theft that consists of an unauthorized access to another person's ...
متن کاملNearest neighbor decoding for additive non-Gaussian noise channels
We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original c...
متن کامل